Smearing Formula for Density Matrices
نویسنده
چکیده
منابع مشابه
Smearing formula for higher-order effective classical potentials
In the variational approach to quantum statistics, a smearing formula efficiently describes the consequences of quantum fluctuations upon an interaction potential. The result is an effective classical potential from which the partition function can be obtained by a simple integral. In this work, the smearing formula is extended to higher orders in the variational perturbation theory. An applica...
متن کاملDensity of States and Thouless Formula for Random Unitary Band Matrices
We study the density of states measure for some class of random unitary band matrices and prove a Thouless formula relating it to the associated Lyapunov exponent. This class of random matrices appears in the study of the dynamical stability of certain quantum systems and can also be considered as a unitary version of the Anderson model. We further determine the support of the density of states...
متن کاملOn the mean density of complex eigenvalues for an ensemble of random matrices with prescribed singular values
Given any fixed N×N positive semi-definite diagonal matrix G ≥ 0 we derive the explicit formula for the density of complex eigenvalues for random matrices A of the form A = U √ G where the random unitary matrices U are distributed on the group U(N) according to the Haar measure.
متن کاملLattice Universe: examples and problems
We consider lattice Universes with spatial topologies [Formula: see text], [Formula: see text], and [Formula: see text]. In the Newtonian limit of General Relativity, we solve the Poisson equation for the gravitational potential in the enumerated models. In the case of point-like massive sources in the [Formula: see text] model, we demonstrate that the gravitational potential has no definite va...
متن کاملامید ریاضی نرخ پوشش برای ماتریس‌های هلمن
Hellman’s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm. After that, all further analyses of researchers are based on this lower bound. In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007